Search Control Methods in Deep Blue
نویسندگان
چکیده
The Deep Blue chess-playing system explores a huge search tree when selecting a move to play, typically examining on the order of 20 to 40 billion positions. Although a relatively complex evaluation function is applied to the leaf positions of this search tree, there is significant possibility of error in the evaluation function values. Incorrect position evaluation can lead to a poor move choice at the root of the search tree. We have developed methods to reduce the susceptibility of Deep Blue to evaluation function errors through the use of selective extensions in alpha-beta search. This paper briefly reviews some of the standard methods employed in game-playing programs to cope with evaluation function errors, and describes some of the techniques used in Deep Blue.
منابع مشابه
Compute-Intensive Methods for Artificial Intelligence
In the 70’s and 80’s the success of knowledge-intensive approaches to problem solving eclipsed earlier work on compute-intensive weak methods. However, in recent years, compute-intensive methods have made a surprising comeback. One of the most prominent examples is the success of IBM’s Deep Blue in defeating Gary Kasparov in the 1997 ACM Challenge match. Deep Blue’s performance led Kasparov to ...
متن کاملChallenge Problems for Artificial Intelligence
AI textbooks and papers often discuss the big questions, such as “how to reason with uncertainty”, “how to reason efficiently”, or “how to improve performance through learning .” It is more difficult, however, to find descriptions of concrete problems or challenges that are still ambitious and interesting, yet not so open-ended. The goal of this panel is to formulate a set of such challenge pro...
متن کاملChallenge Problems for Artiicial Intelligence
AI textbooks and papers often discuss the big ques tions such as how to reason with uncertainty how to reason e ciently or how to improve performance through learning It is more di cult however to nd descriptions of concrete problems or challenges that are still ambitious and interesting yet not so open ended The goal of this panel is to formulate a set of such challenge problems for the eld Ea...
متن کاملDeep Blue
Deep Blue was the first chess computer to defeat a reigning human world chess champion in a regulation match. A number of factors contributed to the system's success, including its ability to extract useful knowledge from a database of 700,000 Grandmaster chess games—a process that has implications for any non-chess knowledge-discovery application involv-A vast database of human experience can ...
متن کاملDoes Deep Blue use AI?
When Deep Blue played Garry Kasparov in February 1996 and May 1997, the extensive IBM web pages devoted to the site claimed that Deep Blue did not use artificial intelligence. We argue that this claim is inaccurate, is representative of a wide-spread phenomenon in the field, and is ultimately harmful to AI. Does Deep-Blue use AI? In February 1996 and May 1997, the reigning world chess champion,...
متن کامل